Proximal Methods for Sparse Hierarchical Dictionary Learning: Supplementary Materials
ثبت نشده
چکیده
We show in this paper that Eq. (1) can be solved exactly in linear time. The procedure aims at solving a dual formulation of Eq. (1) involving the dual norm of ‖.‖ denoted by ‖.‖∗ and defined as ‖κ‖∗ = max‖z‖≤1 zκ for any vector κ in R. We first derive a dual problem based on conic duality [Boyd and Vandenberghe, 2004]. The rationale for using conic duality is to come up with a dual problem without overlapping variables.
منابع مشابه
Proximal Methods for Sparse Hierarchical Dictionary Learning: Supplementary Materials
We show in this paper that Eq. (1) can be solved exactly in linear time. The procedure aims at solving a dual formulation of Eq. (1) involving the dual norm of ‖.‖ denoted by ‖.‖∗ and defined as ‖κ‖∗ = max‖z‖≤1 zκ for any vector κ in R. We first derive a dual problem based on conic duality [Boyd and Vandenberghe, 2004]. The rationale for using conic duality is to come up with a dual problem wit...
متن کاملProximal Methods for Sparse Hierarchical Dictionary Learning
We propose to combine two approaches for modeling data admitting sparse representations: on the one hand, dictionary learning has proven effective for various signal processing tasks. On the other hand, recent work on structured sparsity provides a natural framework for modeling dependencies between dictionary elements. We thus consider a tree-structured sparse regularization to learn dictionar...
متن کاملSpeech Enhancement using Adaptive Data-Based Dictionary Learning
In this paper, a speech enhancement method based on sparse representation of data frames has been presented. Speech enhancement is one of the most applicable areas in different signal processing fields. The objective of a speech enhancement system is improvement of either intelligibility or quality of the speech signals. This process is carried out using the speech signal processing techniques ...
متن کاملProximal Methods for Hierarchical Sparse Coding
Sparse coding consists in representing signals as sparse linear combinations of atoms selected from a dictionary. We consider an extension of this framework where the atoms are further assumed to be embedded in a tree. This is achieved using a recently introduced tree-structured sparse regularization norm, which has proven useful in several applications. This norm leads to regularized problems ...
متن کاملA Novel Image Denoising Method Based on Incoherent Dictionary Learning and Domain Adaptation Technique
In this paper, a new method for image denoising based on incoherent dictionary learning and domain transfer technique is proposed. The idea of using sparse representation concept is one of the most interesting areas for researchers. The goal of sparse coding is to approximately model the input data as a weighted linear combination of a small number of basis vectors. Two characteristics should b...
متن کامل